A Novel Block Cipher Involving a Key bunch Matrix and a Key-based Permutation and Substitution
نویسنده
چکیده
In this paper, we have developed a novel block cipher involving a key bunch matrix supported by a key-based permutation and a key-based substitution. In this analysis, the decryption key bunch matrix is obtained by using the given encryption key bunch matrix and the concept of multiplicative inverse. From the cryptanalysis carried out in this investigation, we have seen that the strength of the cipher is remarkably good and it cannot be broken by any conventional attack. KeywordsKey bunch matrix; encryption; decryption; permutation; substitution; avalanche effect; cryptanalysis.
منابع مشابه
Novel Impossible Differential Cryptanalysis of Zorro Block Cipher
Impossible difference attack is a powerful tool for evaluating the security of block ciphers based on finding a differential characteristic with the probability of exactly zero. The linear layer diffusion rate of a cipher plays a fundamental role in the security of the algorithm against the impossible difference attack. In this paper, we show an efficient method, which is independent of the qua...
متن کاملFault-propagation Pattern Based DFA on SPN Structure Block Ciphers using Bitwise Permutation, with Application to PRESENT and PRINTcipher
This paper proposes a novel fault-propagation pattern based differential fault analysis method FPP-DFA, and proves its feasibility on SPN structure block ciphers using bitwise permutation, such as PRESENT and PRINTcipher. Simulated experiments demonstrate that, with the fault model of injecting one nibble fault into the r-2 round substitution layer, on average 8 and 16 faulty samples can reduce...
متن کاملA Block Cipher using Feistal’s Approach Involving Permutation and Mixing of the Plaintext and the Additive Inverse of Key Matrix
Abstract: In this research, we have developed a block cipher for a block of size 112 bits by using an iterative method involving a permutation of the plaintext and the subkeys generated in each iteration. Here we have represented the plaintext as a matrix of size 14×8, comprising binary bits. In the process of encryption, we have used a key matrix (K), which also consists of binary bits and gen...
متن کاملThe Security of Elastic Block Ciphers Against Key-Recovery Attacks
We analyze the security of elastic block ciphers against key-recovery attacks. An elastic version of a fixed-length block cipher is a variable-length block cipher that supports any block size in the range of one to two times the length of the original block. Our method for creating an elastic block cipher involves inserting the round function of the original cipher into a substitution-permutati...
متن کاملSecured Data Transmission Using Modified LEHS Algorithm in Wireless Sensor Network
In the ancient block Hill cipher, the cipher text is obtained by multiplying the blocks of the plain text with the key matrix. To strengthen the keymatrix, a double guard Hill cipher was proposed with two key matrices, a private key matrix and its modified key matrix along with permutation. In the ancient block Hill cipher, the cipher text is obtained by multiplying the blocks of the plain text...
متن کامل